Convergent evolution with combinatorial peptides
نویسندگان
چکیده
منابع مشابه
Mapping Protein-Protein Interactions With Combinatorial Peptides
Now that a number of genomes have been sequenced, attention has turned to understanding the complement of proteins encoded by the genome, which has been termed the ‘proteome’. One important aspect of analysis of the proteome is the identification of which proteins interact with each other; this information is invaluable in surmising the function of each protein and inferring what cellular pathw...
متن کاملCombinatorial Gradient Fields for 2D Images with Empirically Convergent Separatrices
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost surely to its continuous counterpart when the image resolution is increased. This approach is motivated using basic ideas from probability theory and builds...
متن کاملRandom combinatorial structures: the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribut...
متن کامل4 Random combinatorial structures : the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribut...
متن کاملGlobally convergent evolution strategies
In this paper we show how to modify a large class of evolution strategies (ES’s) for unconstrained optimization to rigorously achieve a form of global convergence, meaning convergence to stationary points independently of the starting point. The type of ES under consideration recombines the parent points by means of a weighted sum, around which the offspring points are computed by random genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: FEBS Letters
سال: 2000
ISSN: 0014-5793
DOI: 10.1016/s0014-5793(00)01778-6